Asynchronous Cellular Automata and Logic for Pomsets without Auto-concurrency

Asynchronous cellular automata for pomsets

This paper extends to pomsets without auto-concurrency the fundamental notion of asynchronous cellular automata (ACA) which was originally introduced for traces by Zielonka. We generalize to pomsets the notion of asynchronous mapping introduced by Cori, Métivier and Zielonka and we show how to construct a deterministic ACA from an asynchronous mapping. Then we investigate the relation between t...

On the Expressiveness of Asynchronous Cellular Automata

We show that a slightly extended version of asynchronous cellular automata, relative to any class of pomsets and dags without autoconcurrency, has the same expressive power as the existential fragment of monadic second-order logic. In doing so, we provide a framework that unifies many approaches to modeling distributed systems such as the models of asynchronous trace automata and communicating ...

Dagstuhl Seminar on Logic, Algebra, and Formal Verification of Concurrent Systems

s of the Talks 6 Pascal Weil Recognizability and regularity for languages of series-parallel pomsets . . . . . . . . . . . . . 6 Lenore Zuck Automatic Deductive Verification with Invisible Invariants . . 7 Manfred Droste Process Cost Functions for Concurrent Systems . . . . . . . . 7 Doron Peled Black Box Checking . . . . . . . . . . . . . . . . . . . . . . . . 8 Rémi Morin On Rational Message ...

Survey of this article: Asynchronous Cellular Automata for pomsets. Mamadou Kanté. Lesson: IR.

Regular Pomset Languages: Closure Properties and Msol Deenability

We compare the general notion of regularity deened in FM02] for languages of pomsets (with autoconcurrency) with the deenability in MSOL of such languages. We show that for the class of bounded languages, deenability implies regularity. It shows that for bounded languages of pomsets without autoconcurrency, the recognisability by Asynchronous Cellular Automata as deened in DGK00] implies regula...